In the problems of minimax tree search , what we are looking for is often the optimal branch at the root node 在極大極小樹搜索時,我們經常尋找的是根節點的最優分支。
This makes prbfm a promising emerging game - tree search algorithm in future chip multiprocessor platforms 這使得prbfm成為將來多核處理器( cmp )多線程游戲樹搜索benchmark的一個有力的備選算法。
Conduct a tree search . ask people to find large , unusual or historic trees in your community . tell people to take care of them 組織一次尋找珍貴樹木的活動,讓人們發現社區內的參天大樹、罕見的樹或者具有歷史意義的樹木,號召人們保護好這些樹。
This thesis discloses some key workload characteristics of tree search applications in some sense , while gives some data support to design intel platform ’ s chip multprocessor 本文在一定程度上揭示了并行樹搜索程序在smp平臺上的關鍵負載特征,為intel平臺設計多核處理器提供了一些數據支持。
Game - tree search plays an important role in the field of artificial intelligence . in this paper we characterize and compare two parallel game - tree search workloads in chess on two intel xeon 游戲樹搜索( game - treesearch )一直以來在人工智能領域扮演著極其重要的角色,并行游戲樹搜索更是該領域的熱點研究問題。